Order-consistent programs are cautiously monotonic
نویسندگان
چکیده
منابع مشابه
Order-consistent programs are cautiously monotonic
Some normal logic programs under the answer set (or stable model) semantics lack the appealing property of “cautious monotonicity.” That is, augmenting a program with one of its consequences may cause it to lose another of its consequences. The syntactic condition of “order-consistency” was shown by Fages to guarantee existence of an answer set. This note establishes that order-consistent progr...
متن کاملA monotonic Higher - Order Semantic
There is an increasing use of ((rst-and higher-order) rewrite rules in many programming languages and logical systems. The recursive path ordering (RPO) is a well-known tool for proving termination of such rewrite rules in the rst-order case Der82]. However, RPO has some weaknesses. For instance, since it is a simpliication ordering, it can only handle simply terminating systems. Several techni...
متن کاملPharma twitters cautiously before advertising guidelines are released.
tion, but much of what they are finding is incorrect or out of date. According to Katie Lubenow, Senior Manager of Corporate Communications for AstraZeneca: “Health care companies have an obligation to responsibly engage in social media to help patients, caregivers, and prescribers make informed decisions about our medicines. It’s important for us because in our absence, consumers could turn to...
متن کاملNoMoRe : Non-monotonic Reasoning with Logic Programs
The non-monotonic reasoning system noMoRe [2] implements answer set semantics for normal logic programs. It realizes a novel, rule-based paradigm to compute answer sets by computing non-standard graph colorings of the block graph associated with a given logic program (see [6, 8, 7] for details). These non-standard graph colorings are called a-colorings or application-colorings since they reflec...
متن کاملProbabilistic Conditionals are Almost Monotonic
We examine some old and new paradoxes of probability, give a rough account of probabilistic conditionals, and prove some new results about non-monotonicity in probabilistic conditionals. It is well known that such conditionals are not monotonic – a conditional which is true can become false when additional hypotheses are added. We show that nonetheless, the conditionals are usually monotonic, i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory and Practice of Logic Programming
سال: 2001
ISSN: 1471-0684,1475-3081
DOI: 10.1017/s1471068401001144